#include <iostream>
#include <cstring>
#include <algorithm>

using namespace std;

typedef unsigned long long ull;
const int N = 1e4 + 10 , P = 131;
ull a[N];
ull get_hash(string &s)
{
    ull ret = 0;
    for(int i = 1;i <= s.size();i ++)
    {
        ret = ret * P + s[i - 1];
    }
    return ret;
}
int main()
{
    int n;
    cin >> n;
    for(int i = 1;i <= n;i ++)
    {
        string s; cin >> s;
        a[i] = get_hash(s);
    }
    int res = 1;
    sort(a + 1 , a + 1 + n);
    for(int i = 2;i <= n;i ++)
    {
        if(a[i] != a[i - 1]) res ++;
    }
    cout << res << endl;
    return 0;
}